/*
Problem 4
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
Answer: 906609*/

#include "funcionesGenerales.h"

using namespace std;


int main(){

for (int n = 998001; n>10000;n--)
{
	if (capicua(n)) if(esMultiplicacionDeDosNumerosDe3Cifras(n)) {
		cout <<n<< endl;	
		
	}
}
return 0;
}

